On self-replication and the halting problem
نویسنده
چکیده
This short Letter elucidates a fundamental relationship between self-replication of living systems and the halting problem in computation theory.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملConfusion of memory
It is a truism that for a machine to have a useful access to memory or workspace, it must “know” where its input ends and its working memory begins. Most machine models separate input from memory explicitly, in one way or another. We are interested here in computational models which do not separate input from working memory. We study the situation on deterministic single-queue machines working ...
متن کاملDyson–schwinger Equations in the Theory of Computation
Following Manin’s approach to renormalization in the theory of computation, we investigate Dyson–Schwinger equations on Hopf algebras, operads and properads of flow charts, as a way of encoding self-similarity structures in the theory of algorithms computing primitive and partial recursive functions and in the halting problem.
متن کاملA Survey of Dynamic Replication Strategies for Improving Response Time in Data Grid Environment
Large-scale data management is a critical problem in a distributed system such as cloud,P2P system, World Wide Web (WWW), and Data Grid. One of the effective solutions is data replicationtechnique, which efficiently reduces the cost of communication and improves the data reliability andresponse time. Various replication methods can be proposed depending on when, where, and howreplicas are gener...
متن کاملA Generalization of Chaitin's Halting Probability \Omega and Halting Self-Similar Sets
We generalize the concept of randomness in an infinite binary sequence in order to characterize the degree of randomness by a real number D > 0. Chaitin’s halting probability Ω is generalized to ΩD whose degree of randomness is precisely D. On the basis of this generalization, we consider the degree of randomness of each point in Euclidean space through its base-two expansion. It is then shown ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006